Computation Initial Degree and Waldschmidt Constant for Sets of Small Number of Multiple Points

Waldschmidt constant is firstly introduced by in 1975. Since then, many results of this was achieved mostly about finding lower bounds. That recently one active, fascinating and important topics. However, computation or the initial degree very hard general, even for cases small numbers points projective plane. Recently, constants were computed certain sets with one, two three supporting lines. The paper shows values at most 6 all configurations These represent complexity optimal solutions repeated path problems that have applications computer science, informatics theory telecommunications.